Solving Multi-Objective Resource Allocation Problem Using Multi-Objective Binary Artificial Bee Colony Algorithm

نویسندگان

چکیده

Resource allocation is the optimal distribution in a limited number of resources available for certain activities. The large activities requires exponentially multiplying computation cost. Therefore, resource problem known as NP-Hard literature. In this study, multi-objective binary artificial bee colony algorithm has been proposed solving problems. benefited from robust structure and easy implementation properties algorithm. contribution to introduce version with advanced local search format using transfer functions. improved two versions sigmoid hyperbolic tangent functions be able space. With algorithms, problems literature are solved, algorithms compared other that develop same results obtained show give effective on problem. Especially, large-scale problems, higher accuracy values reached smaller evaluations.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Elite-guided multi-objective artificial bee colony algorithm

Multi-objective optimization has been a difficult problem and a research focus in the field of science and engineering. This paper presents a novel multi-objective optimization algorithm called elite-guided multi-objective artificial bee colony (EMOABC) algorithm. In our proposal, the fast non-dominated sorting and population selection strategy are applied to measure the quality of the solution...

متن کامل

A dynamic multi-colony artificial bee colony algorithm for multi-objective optimization

This paper suggests a dynamic multi-colony multi-objective artificial bee colony algorithm (DMCMOABC) by using the multi-deme model and a dynamic information exchange strategy. In the proposed algorithm, K colonies search independently most of the time and share information occasionally. In each colony, there are S bees containing equal number of employed bees and onlooker bees. For each food s...

متن کامل

A Novel Multi-Objective Artificial Bee Colony Algorithm for the QoS Based Wireless Route Optimization Problem

In this paper, an efficient multi-objective artificial bee colony optimization algorithm based on Pareto dominance called PC_MOABC is proposed to tackle the QoS based route optimization problem. The concepts of Pareto strength and crowding distance are introduced into this algorithm, and are combined together effectively to improve the algorithm’s efficiency and generate a set of evenly distrib...

متن کامل

Solving a Redundancy Allocation Problem by a Hybrid Multi-objective Imperialist Competitive Algorithm

A redundancy allocation problem (RAP) is a well-known NP-hard problem that involves the selection of elements and redundancy levels to maximize the system reliability under various system-level constraints. In many practical design situations, reliability apportionment is complicated because of the presence of several conflicting objectives that cannot be combined into a single-objective functi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Arabian journal for science and engineering

سال: 2021

ISSN: ['2191-4281', '2193-567X']

DOI: https://doi.org/10.1007/s13369-021-05521-x